The conjugacy problem in automaton groups is not solvable
نویسندگان
چکیده
Article history: Received 14 March 2012 Available online 17 May 2012 Communicated by Derek Holt
منابع مشابه
Some connections between powers of conjugacy classes and degrees of irreducible characters in solvable groups
Let $G$ be a finite group. We say that the derived covering number of $G$ is finite if and only if there exists a positive integer $n$ such that $C^n=G'$ for all non-central conjugacy classes $C$ of $G$. In this paper we characterize solvable groups $G$ in which the derived covering number is finite.
متن کاملClassification of solvable groups with a given property
In this paper we classify all finite solvable groups satisfying the following property P5: their orders of representatives are set-wise relatively prime for any 5 distinct non-central conjugacy classes.
متن کاملOrbit Decidability and the Conjugacy Problem for Some Extensions of Groups
Given a short exact sequence of groups with certain conditions, 1 → F → G → H → 1, we prove that G has solvable conjugacy problem if and only if the corresponding action subgroup A Aut(F ) is orbit decidable. From this, we deduce that the conjugacy problem is solvable, among others, for all groups of the form Z2 Fm, F2 Fm, Fn Z, and Zn A Fm with virtually solvable action group A GLn(Z). Also, w...
متن کاملConjugacy Problem in Groups of Non-oriented Geometrizable 3-manifolds
We have proved in [Pr] that fundamental groups of oriented geometrizable 3manifolds have a solvable conjugacy problem. We now focus on groups of non-oriented geometrizable 3-manifolds in order to conclude that all groups of geometrizable 3-manifolds have a solvable conjugacy problem.
متن کاملThe Conjugacy Problem for Graph Products with Cyclic Edge Groups
A graph product is the fundamental group of a graph of groups Amongst the simplest examples are HNN groups and free products with amalgamation. The conjugacy problem is solvable for recursively presented graph products with cyclic edge groups over finite graphs if the vertex groups have solvable conjugacy problem and the sets of cyclic generators in them are semicritical. For graph products ove...
متن کامل